منابع مشابه
Chain-constrained spanning trees
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as possible. Iterative rounding has become the too...
متن کاملDegree-constrained spanning trees
S of the Ghent Graph Theory Workshop on Longest Paths and Longest Cycles Kathie Cameron Degree-constrained spanning trees 2 Jan Goedgebeur Finding minimal obstructions to graph coloring 3 Jochen Harant On longest cycles in essentially 4-connected planar graphs 3 Frantǐsek Kardoš Barnette was right: not only fullerene graphs are Hamiltonian 4 Gyula Y. Katona Complexity questions for minimally t-...
متن کاملEnumerating Constrained Non-crossing Geometric Spanning Trees
In this paper we present an algorithm for enumerating without repetitions all non-crossing geometric spanning trees on a given set of n points in the plane under edge constraints (i.e., some edges are required to be included in spanning trees). We will first prove that a set of all edge-constrained non-crossing spanning trees is connected via remove-add flips, based on the constrained smallest ...
متن کاملApproximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems
We study the min-cost chain-constrained spanning-tree (abbreviated MCCST) problem: find a mincost spanning tree in a graph subject to degree constraints on a nested family of node sets. We devise the first polytime algorithm that finds a spanning tree that (i) violates the degree constraints by at most a constant factor and (ii) whose cost is within a constant factor of the optimum. Previously,...
متن کاملDetermining Hop-Constrained Spanning Trees with Repetitive Heuristics
The Hop-constrained Minimum Spanning Tree Problem (HMST) is defined as follows: Given a graph G = (V, E) with node set V = {0, 1, . . . , n}, edge set E as well as a cost ce associated with each edge e ∈ E and a natural number H , we wish to find a spanning tree T of the graph with minimum total cost such that the unique path from a specified root node, node 0, to any other node has no more tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2017
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-017-1126-7